Minimizing View Sets without Losing Query-Answering Power
نویسندگان
چکیده
The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, we often need to select a subset of views to maintain due to limited resources. In this paper, we show that traditional query containment is not a good basis for deciding whether or not a view should be selected. Instead, we should minimize the view set without losing its query-answering power. To formalize this notion, we rst introduce the concept of \p-containment." That is, a view set V is p-contained in another view set W, if W can answer all the queries that can be answered by V. We show that p-containment and the traditional query containment are not related. We then discuss how to minimize a view set while retaining its query-answering power. We develop the idea further by considering p-containment of two view sets with respect to a given set of queries, and consider their relationship in terms of maximally-contained rewritings of queries using the views.
منابع مشابه
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may appear in more than one answer set, and some elements in some answer sets may be subelements of other elements in other (or the same) answer sets. Even when a client submits a single query, the answer can be self-redu...
متن کاملOffline Design Tuning for Hierarchies of Forecast Models
Forecasting of time series data is crucial for decision-making processes in many domains as it allows the prediction of future behavior. In this context, a model is fit to the observed data points of the time series by estimating the model parameters. The computed parameters are then utilized to forecast future points in time. Existing approaches integrate forecasting into traditional relationa...
متن کاملAnswering Queries Determined by Views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. In this paper we investigate this problem in the case where the answers to the views uniquely determine the answers to the query. We say that a view set V determines a query Q if for any two databases D1, D2 it holds: V(D1) = V(D2) implies Q(D1) = Q(D...
متن کاملNew Expressive Languages for Ontological Query Answering
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensional knowledge which may contribute to answer a query. Recently, the Datalog± family of ontology languages was introduced; in Datalog±, rules are tuple-generating dependencies (TGDs), i.e., Datalog rules with the possib...
متن کامل